mine top frequent item data stream flexibl slide window hoang thanh lam toon calder studi problem find frequent item stream item recent propos max frequenc measur base properti item max frequenc item count slide window length dynam parameterless measur support item shown advantag faster detect burst stream set item heterogen algorithm propos maintain frequent item scale poorli number item larg paper propos report frequent item mine top frequent prove order solv problem prohibit amount memori linear number item reason condit show theoret empir memori effici algorithm exist prototyp algorithm implement present perform memori effici real life data control experi synthet data 